I/o Efficient Algorithms and Applications in Geographic Information Systems Abstract I/o Efficient Algorithms and Applications in Geographic Information Systems
نویسنده
چکیده
I/O EFFICIENT ALGORITHMS AND APPLICATIONS IN GEOGRAPHIC INFORMATION SYSTEMS
منابع مشابه
I / O Efficient Algorithms and Applications in Geographic Information Systems
I/O EFFICIENT ALGORITHMS AND APPLICATIONS IN GEOGRAPHIC INFORMATION SYSTEMS by
متن کاملExternal-Memory Algorithms with Applications in GIS
Preface In the design of algorithms for large-scale applications it is essential to consider the problem of minimizing Input/Output (I/O) communication. Geographical information systems (GIS) are good examples of such large-scale applications as they frequently handle huge amounts of spatial data. In this note we survey the recent developments in external-memory algorithms with applications in ...
متن کاملRoman Dementiev Algorithm Engineering for Large Data Sets
In recent years, the development of theoretically I/O-efficient algorithms and data structures has received considerable attention. However, much less has been done to evaluate their performance, in particular with parallel disks or when running on large inputs with sizes that really require external memory. This thesis presents the software library Stxxl that enables practice-oriented experime...
متن کاملEfficient External-Memory Data Structures and Applications
In this thesis we study the Input/Output (I/O) complexity of large-scale problems arising e.g. in the areas of database systems, geographic information systems, VLSI design systems and computer graphics, and design I/O-efficient algorithms for them. A general theme in our work is to design I/O-efficient algorithms through the design of I/O-efficient data structures. One of our philosophies is t...
متن کامل5. I/O-Efficient Algorithms for Sparse Graphs
Massive graphs arise naturally in many applications. Recent web crawls, for example, produce graphs with on the order of 200 million nodes and 2 billion edges. Recent research in web modelling uses depth-first search, breadth-first search, and the computation of shortest paths and connected components as primitive routines for investigating the structure of the web [158]. Massive graphs are als...
متن کامل